Trust propagation - cardinality-based approach
نویسنده
چکیده
The article deals with a problem of modelling and propagating trust in trust networks (social networks, recommender systems, integrating systems). We briefly recall some of the solutions and approaches proposed by other authors and we focus on a trust model based on IFS theory (Atanassov’s intuitionistic fuzzy set theory). Then we present a draft of a method of calculating trust propagation with a use of a relative cardinality of IFS.
منابع مشابه
Detecting Cardinality Constraints in CNF
We present novel approaches to detect cardinality constraints expressed in CNF. The first approach is based on a syntactic analysis of specific data structures used in SAT solvers to represent binary and ternary clauses, whereas the second approach is based on a semantic analysis by unit propagation. The syntactic approach computes an approximation of the cardinality constraints AtMost-1 and At...
متن کاملAnalysis of a Trust-Based Access Control Model for Ubiquitous Environments
There are a number of models for access control in ubiquitous environments that are based on trust propagation. Iterative multiplication of trust values on a path from a source entity to a target entity is one approach to trust propagation. In this paper we summarize our model for access control based on this approach. As a novel contribution, we perform experiments to determine the effectivene...
متن کاملA Transitivity Aware Matrix Factorization Model for Recommendation in Social Networks
Recommender systems are becoming tools of choice to select the online information relevant to a given user. Collaborative filtering is the most popular approach to building recommender systems and has been successfully employed in many applications. With the advent of online social networks, the social network based approach to recommendation has emerged. This approach assumes a social network ...
متن کاملTrust Propagation with Mixed-Effects Models
Web-based social networks typically use public trust systems to facilitate interactions between strangers. These systems can be corrupted by misleading information spread under the cover of anonymity, or exhibit a strong bias towards positive feedback, originating from the fear of reciprocity. Trust propagation algorithms seek to overcome these shortcomings by inferring trust ratings between st...
متن کاملA Pigeon-Hole Based Encoding of Cardinality Constraints
In this paper, we propose a new encoding of the cardinality constraint ∑i=1 xi > b. It makes an original use of the general formulation of the Pigeon-Hole principle to derive a formula in conjunctive normal form (CNF). Our Pigeon-Hole based CNF encoding can be seen as a nice and simple way to express the semantic of the cardinality constraint, that can be defined as how to put b pigeons into n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009